The Infinite Binary Tree and the Galton - Watson Process
نویسنده
چکیده
Percolation is essentially the study of what happens to a graph when one chooses to remove vertices or edges at random. In particular, one usually chooses some probability, q, and then chooses to remove each edge (or vertex) independently with probability q. We typically study the size and shape of the largest connected component in the remaining graph. We will only study the case in which edges are removed. This is what Physicists call bond percolation.
منابع مشابه
Galton – Watson trees , random allocations and condensation : Extended abstract
We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other cases (i.e., when no equivalent critical Galton-Watson tree exists). There is a well-defined limit in the form of an infinite random tree in all ca...
متن کاملPruning Galton-Watson Trees and Tree-valued Markov Processes
Abstract. We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process {G(u)} by pruning Galton-Watson trees and an analogous process {G(u)} by pruning a critical or subcritical Galton-Watson tree conditioned to be infinite. Under a mild condition on offspring distributions, we show that ...
متن کاملIdeals in a Forest, One-way Infinite Binary Trees and the Contraction Method
The analysis of an algorithm by Koda and Ruskey for listing ideals in a forest poset leads to a study of random binary trees and their limits as infinite random binary trees. The corresponding finite and infinite random forests are studied too. The infinite random binary trees and forests studied here have exactly one infinite path; they can be defined using suitable size-biazed Galton–Watson p...
متن کاملSurvival Probabilities for N -ary Subtrees on a Galton-Watson Family Tree
The family tree of a Galton-Watson branching process may contain N -ary subtrees, i.e. subtrees whose vertices have at least N ≥ 1 children. For family trees without infinite N -ary subtrees, we study how fast N -ary subtrees of height t disappear as t → ∞.
متن کاملThe shape of large Galton-Watson trees with possibly infinite variance
Let T be a critical or subcritical Galton-Watson family tree with possibly infinite variance. We are interested in the shape of T conditioned to have a large total number of vertices. For this purpose we study random trees whose conditional distribution given their size is the same as the respective conditional distribution of T. These random family trees have a simple probabilistic structure i...
متن کامل